A question on number system

Find a number consisting of 9 digits in which each of the digits from 1 to 9 appears only once. This number should satisfy the following requirements: a. The number should be divisible by 9. b. If the most right digit is removed, the remaining number should be divisible by 8. c. If then again the most right digit is removed, the remaining number should be divisible by 7. d. etc. until the last remaining number of one digit which should be divisible by 1.

Damn sure I have seen this

Damn sure I have seen this question earlier let me make a search. Give me sometime I will put the answers From where you got this question..

One of my friend asked today

One of my friend asked today in the office and after wasting few hours he told me the answer is 381654729. But I am yet to find any clue about getting all the digits Its quite obvious the 5th digit is 5. But what about others? I think it’s a TIME question.

A google search took me to

A google search took me to the following link where the original question with the solution is published. Check out http://www.pzzls.com/divisible_from_1_to_9_puzzle/solution.html